Sampling and Counting Contingency Tables Using Markov Chains
نویسنده
چکیده
In this paper we present an overview of contingency tables, provide an introduction to the problems of almost uniform sampling and approximate counting, and show recent results achieved through the use of Markov chains. We focus specifically on contingency tables with two rows, since as of this time little progress has been made in achieving reasonable bounds on arbitrarily sized contingency tables.
منابع مشابه
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] have recently given a fully polynomial randomized approximation scheme (fpras) for the related counting problem, which employs Markov chain methods indirectly. They leave open the question as to whether a natural Markov...
متن کاملApproximate Counting Scheme for m X n Contingency Tables
In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...
متن کاملThe University of Chicago Faster Markov Chain Monte Carlo Algorithms for the Permanent and Binary Contingency Tables a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy
Random sampling and combinatorial counting are important building blocks in many practical applications. However, for some problems exact counting in deterministic polynomial-time is provably impossible (unless P = NP ), in which case the best hope is to devise suitable approximation algorithms. Markov chain Monte Carlo (MCMC) methods give efficient approximation algorithms for several importan...
متن کاملLattice Points, Contingency Tables, and Sampling
Markov chains and sequential importance sampling (SIS) are described as two leading sampling methods for Monte Carlo computations in exact conditional inference on discrete data in contingency tables. Examples are explained from genotype data analysis, graphical models, and logistic regression. A new Markov chain and implementation of SIS are described for logistic regression.
متن کاملMinimal basis for connected Markov chain over 3× 3×K contingency tables with fixed two-dimensional marginals
We consider connected Markov chain for sampling 3 × 3 × K contingency tables having fixed two-dimensional marginal totals. Such sampling arises in performing various tests of the hypothesis of no three-factor interactions. Markov chain algorithm is a valuable tool for evaluating p values, especially for sparse data sets where large-sample theory does not work well. For constructing a connected ...
متن کامل